package com.xmg.leetCode;

/**
 * @Author: mazhongqing
 * @Date: 2021/3/18 16:34
 */
public class No25 {
}
class Solution25 {
    public ListNode reverseKGroup(ListNode head, int k) {
        int len = 0;
        ListNode temp = head;
        while (temp!=null){
            temp = temp.next;
            len++;
        }
        if(len<=k){
            return head;
        }
        ListNode dummyNode = new ListNode(-1,head);
        ListNode cur = dummyNode;
        for (int i = 0; i < k; i++) {
            ListNode p1 = cur.next;
        }

        return null;
    }
}
